Computational complexity theory

Results: 2049



#Item
101Exact and Efficient Generation of Geometric Random Variates and Random Graphs Karl Bringmann1 and Tobias Friedrich2 1  Max-Planck-Institut f¨

Exact and Efficient Generation of Geometric Random Variates and Random Graphs Karl Bringmann1 and Tobias Friedrich2 1 Max-Planck-Institut f¨

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:45:52
102PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡

PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡

Add to Reading List

Source URL: users.eecs.northwestern.edu

Language: English - Date: 2009-09-15 22:21:32
103Forecasting Run-Times of Secure Two-Party Computation Axel Schr¨opfer Florian Kerschbaum

Forecasting Run-Times of Secure Two-Party Computation Axel Schr¨opfer Florian Kerschbaum

Add to Reading List

Source URL: www.fkerschbaum.org

Language: English - Date: 2011-09-10 05:30:51
104The Logarithmic Hypervolume Indicator Tobias Friedrich Karl Bringmann  Max-Planck-Institut für Informatik

The Logarithmic Hypervolume Indicator Tobias Friedrich Karl Bringmann Max-Planck-Institut für Informatik

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:45:18
105Capacity of Arbitrary Wireless Networks Olga Goussevskaia Roger Wattenhofer  Computer Engineering and

Capacity of Arbitrary Wireless Networks Olga Goussevskaia Roger Wattenhofer Computer Engineering and

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:24
106.  CS711008Z Algorithm Design and Analysis Lecture 5. Basic algorithm design technique: Divide-and-Conquer 1

. CS711008Z Algorithm Design and Analysis Lecture 5. Basic algorithm design technique: Divide-and-Conquer 1

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2016-03-29 21:49:55
107Black-Box Complexity—A Complexity Theory for Evolutionary Computation ´ Presenter: Benjamin Doerr, Ecole Polytechnique de Paris, France; email .

Black-Box Complexity—A Complexity Theory for Evolutionary Computation ´ Presenter: Benjamin Doerr, Ecole Polytechnique de Paris, France; email .

Add to Reading List

Source URL: www.conference123.org

Language: English - Date: 2014-07-16 23:22:02
108Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch

Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:12
109Book, chapter of book, survey articles April 12, L´ aszl´ o Babai and P´eter Frankl. Linear Algebra Methods in Combinatorics, with Applications to Geometry and Computer Science. Univ. of Chicago Dept. Compu

Book, chapter of book, survey articles April 12, L´ aszl´ o Babai and P´eter Frankl. Linear Algebra Methods in Combinatorics, with Applications to Geometry and Computer Science. Univ. of Chicago Dept. Compu

Add to Reading List

Source URL: people.cs.uchicago.edu

Language: English - Date: 2014-04-12 05:16:42